Decidability for Priorean Linear Time Using a Fixed-Point Labelled Calculus
نویسندگان
چکیده
A labelled sequent calculus is proposed for Priorean linear time logic, the rules of which reflect a natural closure algorithm derived from the fixed-point properties of the temporal operators. All the rules of the system are finitary, but proofs may contain infinite branches. Soundness and completeness of the calculus are stated with respect to a notion of provability based on a condition on derivation trees: A sequent is provable if and only if no branch leads to a ‘fulfilling sequent,’ the syntactical counterpart of a countermodel for an invalid sequent. Decidability is proved through a terminating proof search procedure, with an exponential bound to the branches of derivation trees for valid sequents, calculated on the length of the characteristic temporal formula of the
منابع مشابه
The decidability of guarded fixed point logic
Guarded fixed point logics are obtained by adding least and greatest fixed points to the guarded fragments of first-order logic that were recently introduced by Andréka, van Benthem and Németi. Guarded fixed point logics can also be viewed as the natural common extensions of the modal μ-calculus and the guarded fragments. In a joint paper with Igor Walukiewicz, we proved recently that the satis...
متن کاملModal Fixed Point Logics
These four lectures are centered around multi-modal logics extended by the possibility to introduce least and largest fixed points. We begin with discussing a range of traditional results and turn towards a more explicit and operational approach in the fourth lecture. Our focus will be on foundational questions rather than practical applications, which will be – I assume – treated in other lect...
متن کاملEvaluation is MSOL-compatible
We consider simply-typed lambda calculus with fixpoint operators. Evaluation of a term gives as a result the Böhm tree of the term. We show that evaluation is compatible with monadic secondorder logic (MSOL). This means that for a fixed finite vocabulary of terms, the MSOL properties of Böhm trees of terms are effectively MSOL properties of terms themselves. Theorems of this kind have been know...
متن کاملTriple positive solutions of $m$-point boundary value problem on time scales with $p$-Laplacian
In this paper, we consider the multipoint boundary value problem for one-dimensional $p$-Laplacian dynamic equation on time scales. We prove the existence at least three positive solutions of the boundary value problem by using the Avery and Peterson fixed point theorem. The interesting point is that the non-linear term $f$ involves a first-order derivative explicitly. Our results ...
متن کاملOn the Decidability of Model Checking for Several µ-calculi and Petri Nets
The decidability of the model checking problem for several-calculi and Petri nets is analysed. The linear time-calculus is decidable; if simple atomic sentences are added, it becomes undecidable. A very simple subset of the modal-calculus is undecidable.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009